Parametric Maximum Flow Problem: Techniques and Algorithms
نویسندگان
چکیده
PARAMETRIC MAXIMUM FLOW PROBLEM: TECHNIQUES AND ALGORITHMS Deepika Sareen and Deepak Garg Thapar University, Patiala E-mails: [email protected], [email protected] We encounter many different types of networks in our everyday lives, including electrical, telephone, cable, highway, rail, manufacturing and computer networks. Networks consist of special points called nodes and links connecting pairs of nodes called arcs. The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively. From last few decades researchers have made a steady stream of innovation that have resulted in new solution methods and improvements to known methods. Continuous improvements to algorithms have been made by researchers for solving several classes of problems. In this paper recent techniques and algorithms related to parametric maximum flow problem are given.
منابع مشابه
A Parallel Framework for Parametric Maximum Flow Problems in Image Segmentation
This paper presents a framework that supports the implementation of parallel solutions for the widespread parametric maximum flow computational routines used in image segmentation algorithms. The framework is based on supergraphs, a special construction combining several image graphs into a larger one, and works on various architectures (multi-core or GPU), either locally or remotely in a clust...
متن کاملDistance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the le...
متن کاملFlow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Abstraction techniques based on simulation relations have become an important and effective proof technique to avoid the infamous state space explosion problem. In the context of Markov chains, strong and weak simulation relations have been proposed [17, 6], together with corresponding decision algorithms [3, 5], but it is as yet unclear whether they can be used as effectively as their non-stoc...
متن کاملBalancing Applied to Maximum Network Flow
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a ...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کامل